Optimal Online Algorithms for File-Bundle Caching and Generalization to Distributed Caching
نویسندگان
چکیده
We consider a generalization of the standard cache problem called file-bundle caching, where different queries (tasks), each containing l ≥ 1 files, sequentially arrive. An online algorithm that does not know sequence ahead time must adaptively decide on what files to keep in incur minimum number misses. Here miss refers case at least one file query is missing among files. In special = 1, this reduces problem. first analyze performance classic recently used (LRU) setting and show LRU near-optimal deterministic for caching with regard competitive ratio. then extend our results generalized ( h,k )-paging setting, size k compared an optimal offline benchmark smaller h < . latter case, we provide randomized O ln / k-h )-competitive h, problem, which can be viewed as extension marking complete result by providing matching lower bound ratio, indicating modified within factor 2 any algorithm. Finally, look distributed version there are m identical caches system. + caches, 2l 1)-competitive when 2. also general framework devise other efficient algorithms evaluate through simulations.
منابع مشابه
Efficient Algorithms for Multi-file Caching
Multi-File Caching issues arise in applications where a set of jobs are processed and each job requests one or more input files. A given job can only be started if all its input files are preloaded into a disk cache. Examples of applications where Multi-File caching may be required are scientific data mining, bit-sliced indexes, and analysis of sets of vertically partitioned files. The differen...
متن کاملWrite Caching in Distributed File Systems
Disk caches are employed in distributed le systems to avoid network accesses at clients and to compensate for the speed diierential between main memory and disk at le servers. Because of concerns about volatility, however, write requests have typically not beneetted from the presence of caches. Instead, they have been processed with some sort of write-through or periodic write-back approach to ...
متن کاملDistributed Caching in Networked File Systems
Changing relative performance of processors, networks, and disks makes it necessary to reconsider algorithms using these three resources. As networks get faster and less congested topologies emerge, it becomes important to use network resources more aggressively to obtain good performance. Substitution of local disk accesses by accesses to remote memory can lead to better balanced resource usag...
متن کاملDistributed caching in unstructured peer-to-peer file sharing networks
Nowadays, the peer-to-peer (P2P) system is one of the largest Internet bandwidth consumers. To relieve the burden on Internet backbone and improve the query and retrieve performance of P2P file sharing networks, efficient P2P caching algorithms are of great importance. In this paper, we propose a distributed topology-aware unstructured P2P file caching infrastructure and design novel placement ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM transactions on modeling and performance evaluation of computing systems
سال: 2021
ISSN: ['2376-3647', '2376-3639']
DOI: https://doi.org/10.1145/3445028